翻訳と辞書 Words near each other ・ Primera C ・ Primera Catalana ・ Primera D ・ Primera dama ・ Primera dama (Chilean telenovela) ・ Primera dama (Colombian telenovela) ・ Primera Divisió ・ Primera Divisió (futsal) ・ Primera división ・ Primera División (women) ・ Primera División A Clausura 2008 ・ Primera División A Clausura 2009 ・ Primera División de Ascenso ・ Prime number ・ Prime Number (short story collection) ・ Prime number theorem ・ Prime number theory ・ Prime Obsession ・ Prime of My Life ・ Prime Pages ・ Prime Point Foundation ・ Prime Policy Group ・ Prime pour l'emploi ・ Prime power ・ Prime Prep Academy ・ Prime Press ・ Prime quadruplet ・ Prime Radio Sri Lanka ・ Prime rate ・ Prime reciprocal magic square Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Prime number theorem ： ウィキペディア英語版 Prime number theorem In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée-Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function). The first such distribution found is , where π(''N'') is the prime-counting function and log(''N'') is the natural logarithm of ''N''. This means that for large enough ''N'', the probability that a random integer not greater than ''N'' is prime is very close to . Consequently, a random integer with at most 2''n'' digits (for large enough ''n'') is about half as likely to be prime as a random integer with at most ''n'' digits. For example, among the positive integers of at most 1000 digits, about one in 2300 is prime (), whereas among positive integers of at most 2000 digits, about one in 4600 is prime (). In other words, the average gap between consecutive prime numbers among the first ''N'' integers is roughly log(''N''). ==Statement== Let π(''x'') be the prime-counting function that gives the number of primes less than or equal to ''x'', for any real number ''x''. For example, π(10) = 4 because there are four prime numbers (2, 3, 5 and 7) less than or equal to 10. The prime number theorem then states that ''x'' / log(''x'') is a good approximation to π(''x''), in the sense that the limit of the ''quotient'' of the two functions π(''x'') and ''x'' / log(''x'') as ''x'' increases without bound is 1: : $\backslash lim\_\backslash frac=1,$ known as the asymptotic law of distribution of prime numbers. Using asymptotic notation this result can be restated as :$\backslash pi(x)\backslash sim\backslash frac.\backslash !$ This notation (and the theorem) does ''not'' say anything about the limit of the ''difference'' of the two functions as ''x'' increases without bound. Instead, the theorem states that ''x''/log(''x'') approximates π(''x'') in the sense that the relative error of this approximation approaches 0 as ''x'' increases without bound. The prime number theorem is equivalent to the statement that the ''n''th prime number ''p''''n'' satisfies :$p\_n\; \backslash sim\; n\backslash log(n)$, the asymptotic notation meaning, again, that the relative error of this approximation approaches 0 as ''n'' increases without bound. For example, the 200 · 1015th prime number is 8512677386048191063, and (200 · 1015)log(200 · 1015) rounds to 7967418752291744388, a relative error of about 6.4%. The prime number theorem is also equivalent to $\backslash lim\_\; \backslash fracx\; =\; 1$, and $\backslash lim\_\; \backslash fracx=1$, where $\backslash vartheta$ and $\backslash psi$ are the first and the second Chebyshev functions respectively. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Prime number theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.